Efficient Algorithms for Eulerian Extension
نویسندگان
چکیده
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in scheduling and routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard Weighted Multigraph Eulerian Extension is fixed-parameter tractable with respect to the number k of extension edges (arcs). For an n-vertex multigraph, the corresponding running time amounts to O(4 · n). This implies a fixed-parameter tractability result for the “equivalent” Rural Postman problem. In addition, we present several polynomial-time algorithms for natural Eulerian extension problems.
منابع مشابه
Efficient Algorithms for Eulerian Extension and Rural Postman
The aim of directed Eulerian extension problems is to make a given directed, possibly arc-weighted, (multi-)graph Eulerian by adding a minimum-cost set of arcs. These problems have natural applications in scheduling and arc routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard WeightedMultigraph Eulerian Extension problem ...
متن کاملDNA sequence assembly and multiple sequence alignment by an Eulerian path approach.
We describe an Eulerian path approach to the DNA fragment assembly that was originated by Idury and Waterman 1995, and then advanced by Pevzner et al. 2001b. This combinatorial approach bypasses the traditional “overlap-layout-consensus” approach and successfully resolved some of the troublesome repeats in practical assembly projects. The assembly results by the Eulerian path approach are accur...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملEasy and Hard Testbeds for Real-Time Search Algorithms
Although researchers have studied which factors influence the behavior of traditional search algorithms, currently not much is known about how domain properties influence the performance of real-time search algorithms. In this paper we demonstrate, both theoretically and experimentally, that Eulerian state spaces(a supersetof undirected state spaces)are very easy for some existing real-time sea...
متن کاملDynamic Fracture Analysis Using an Uncoupled Arbitrary Lagrangian Eulerian Finite Element Formulation
This paper deals with the implementation of an efficient Arbitrary Lagrangian Eulerian (ALE) formulation for the three dimensional finite element modeling of mode I self-similar dynamic fracture process. Contrary to the remeshing technique, the presented algorithm can continuously advance the crack with the one mesh topology. The uncoupled approach is employed to treat the equations. So, each t...
متن کامل